Context-Sensitive Term-Rewriting
نویسنده
چکیده
At first an introduction to context-sensitive rewrite-systems is given. The main part of this paper deals with the topic how one can prove termination of contextsensitive rewrite-systems. This can be done either by either transforming them into non context-sensitive ones or by extending the existing techniques which are used to prove termination of classic rewrite systems. This is described in detail for dependency pairs.
منابع مشابه
Termination of Context-Sensitive Rewriting
Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...
متن کاملTermination of context-sensitive rewriting
Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...
متن کاملA Visual Environment for Developing Context-Sensitive Term Rewriting Systems1
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in establishing type soundness proofs. Unfortunately, developing such semantics is an error-prone activity. To address that problem, we have designed PLT Redex, an embedded domain-specific language that helps users interacti...
متن کاملTransformation techniques for context-sensitive rewrite systems
Context-sensitive rewriting is a computational restriction of term rewriting used to model non-strict (lazy) evaluation in functional programming. The goal of this paper is the study and development of techniques to analyze the termination behavior of context-sensitive rewrite systems. For that purpose, several methods have been proposed in the literature which transform contextsensitive rewrit...
متن کاملFreezing { Termination Proofs for Classical, Context-Sensitive and Innermost Rewriting
Freezing is a powerful technique for orienting equations. Here we give a new presentation of it which is suitable for an eecient automatic use. Further, it is shown how slight modiications of it can be applied to context-sensitive and innermost term rewriting. The experimental results on an extensive test series of non-trivial examples performed using a prototype implementation strongly underli...
متن کاملA Visual Environment for Developing Context-Sensitive Term Rewriting Systems
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in establishing type soundness proofs. Unfortunately, developing such semantics is an error-prone activity. To address that problem, we have designed PLT Redex, an embedded domain-specific language that helps users interacti...
متن کامل